A time-expanded network reduction matheuristic for the logistics service network design problem

Planning cost-effective logistics operations involve the integration of multiple decision-making levels. In domain supply chain management, last decades have seen emergence 3PL service providers that specialize in integrating warehousing and transportation services. this paper, we study performed by a provider management French restaurant chain. The planning process is assisted solving Logistics Service Network Design Problem (LSNDP). As realistic instances are too large for on-the-shelf optimization solvers to solve acceptable run-times, develop network reduction heuristic inspired recent Dynamic Discretization Discovery algorithm. Through an extensive series experiments carried out on based industrial partner, demonstrate efficiency proposed approach. We also investigate impact distribution strategy used practice determine plan how can be modified reduce overall costs.